Cryptoschemes Based on New Signature Formation Mechanism
نویسندگان
چکیده
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a novel mechanism of the signature generation is used, in which two parameters of the (k, S) or (R, S) signature are defined after solving a system of two congruences. In the case of composite modulus additional restrictions conditions have been introduced for selection of the public key.
منابع مشابه
Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems
The paper proposes a general method for construction cryp-toschemes based on difficulty of simultaneous solving factoring (FP) and discrete logarithm modulo prime problem (DLpP). The proposed approach is applicable for construction digital signatures (usual, blind, collective), public key encryption algorithms, public key distribution protocols, and cryptoschemes of other types. Moreover, the p...
متن کاملAn ECC-Based Mutual Authentication Scheme with One Time Signature (OTS) in Advanced Metering Infrastructure
Advanced metering infrastructure (AMI) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication. This study focuses on communication between a smart meter and a server on the utility side. Hence, a mutual authentication mechanism in AMI is presented based on the elliptic curve cryptography (ECC) and one time signature (OTS) consists o...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملOn Using Mersenne Primes in Designing Cryptoschemes
The paper proposes justification of using Mersenne primes in the following cryptoschemes: commutative and publickey encryption algorithms and zero-knowledge protocol. The cryptoschemes are based on computational difficulty of finding discrete logarithm in the finite fields GF (2), where s is a sufficiently large prime such that 2s−1 is also a prime, for example s = 1279, s = 2203, and s = 4253.
متن کاملImprovement and parallelization of Snort network intrusion detection mechanism using graphics processing unit
Nowadays, Network Intrusion Detection Systems (NIDS) are widely used to provide full security on computer networks. IDS are categorized into two primary types, including signature-based systems and anomaly-based systems. The former is more commonly used than the latter due to its lower error rate. The core of a signature-based IDS is the pattern matching. This process is inherently a computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 14 شماره
صفحات -
تاریخ انتشار 2006